One sided invertibility and localisation

One-Sided Interval Trees

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

One - sided Versus Two - sided Error in

On one-sided versus two-sided classification

One-sided classiiers are computable devices which read the characteristic function of a set and output a sequence of guesses which converges to 1 ii the set on the input belongs to the given class. Such a classiier is two-sided if the sequence of its output in addition converges to 0 on sets not belonging to the class. The present work obtains the below mentioned results for one-sided classes (...

One-sided Logic in Two-sided Markets

In this paper, I consider eight basic fallacies that can arise from using conventional wisdom from one-sided markets in two-sided market settings. These fallacies are illustrated using statements made in the context of regulatory investigations into credit card schemes in Australia and the United Kingdom. I discuss how these fallacies may be reconciled by proper use of a two-sided market analys...

One-sided epsilon-approximants

Given a finite point set P ⊂ R, we call a multiset A a one-sided weak ε-approximant for P (with respect to convex sets), if |P ∩ C|/|P | − |A ∩C|/|A| ≤ ε for every convex set C. We show that, in contrast with the usual (two-sided) weak ε-approximants, for every set P ⊂ R there exists a one-sided weak ε-approximant of size bounded by a function of ε and d.